resultant of polynomials

См. также в других словарях:

• Resultant — In mathematics, the resultant of two monic polynomials P and Q over a field k is defined as the product:mathrm{res}(P,Q) = prod {(x,y):,P(x)=0,, Q(y)=0} (x y),,of the differences of their roots, where x and y take on values in the algebraic… …   Wikipedia

• resultant — /ri zul tnt/, adj. 1. that results; following as a result or consequence. 2. resulting from the combination of two or more agents: a resultant force. n. 3. Math., Physics. See vector sum. 4. Math. a determinant the entries of which are the… …   Universalium

• Weil reciprocity law — In mathematics, the Weil reciprocity law is a result of André Weil holding in the function field K ( C ) of an algebraic curve C over an algebraically closed field K . Given functions f and g in K ( C ), i.e. rational functions on C , then: f ((… …   Wikipedia

• Discriminant — In algebra, the discriminant of a polynomial is an expression which gives information about the nature of the polynomial s roots. For example, the discriminant of the quadratic polynomial is Here, if Δ > 0, the polynomial has two real roots,… …   Wikipedia

• Fermat (computer algebra system) — Infobox Software name = Fermat caption = developer = Robert H. Lewis latest release version = 3.9.7 latest release date = May 6 2008 programming language = C operating system = Mac OS X, Mac OS, Linux, Unix, Windows genre = Computer algebra… …   Wikipedia

• List of polynomial topics — This is a list of polynomial topics, by Wikipedia page. See also trigonometric polynomial, list of algebraic geometry topics.Basics*Polynomial *Coefficient *Monomial *Polynomial long division *Polynomial factorization *Rational function *Partial… …   Wikipedia

• Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on …   Wikipedia

• Intersection number — In mathematics, the concept of intersection number arose in algebraic geometry, where two curves intersecting at a point may be considered to meet twice if they are tangent there. In the sense that multiple intersections are limiting cases of n… …   Wikipedia

• Regular chain — In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular… …   Wikipedia

• Algebraic integer — This article deals with the ring of complex numbers integral over Z. For the general notion of algebraic integer, see Integrality .In number theory, an algebraic integer is a complex number which is a root of some monic polynomial (leading… …   Wikipedia

• Bézout matrix — In mathematics, a Bézout matrix (or Bézoutian) is a special square matrix associated to two polynomials. Such matrices are sometimes used to test the stability of a given polynomial.DefinitionLet f ( z ) and g ( z ) be two complex polynomials of… …   Wikipedia